Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network

Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path for IP networks. However, is inflexible sometimes results in congestion on some critical links. By separating the control plane data plane, centralized of Software Defined Networking (SDN)-based approach possesses flexible capabilities. Fibbing an that can achieve over a network running distributed protocols. In Fibbing-controlled network, controller cleverly generates fake protocol messages to manipulate routers steer flow desired paths. introducing nodes destroys structure loop-free property Loop-Free Alternate (LFA) used fast failure recovery This paper addresses this issue presents solution provision paths so still apply LFA network. The proposed jointly considers load-balanced recovery. We formulate problem as integer linear programming problem. numerical reveal method provide 100% survivability against any single node or link failure.